CHARACTER STACKS ARE PORC COUNT
نویسندگان
چکیده
Abstract We compute the number of points over finite fields character stack associated to a compact surface group and reductive with connected centre. find that answer is polynomial on residue classes (PORC). The key ingredients in proof are Lusztig’s Jordan decomposition complex characters groups Deriziotis’s results their genus numbers. As consequence our main theorem, we obtain an expression for E -polynomial stack.
منابع مشابه
The Equivariant Chern Character as Super Holonomy on Loop Stacks
We study super parallel transport around super loops in a quotient stack, and show that this geometry constructs a global version of the equivariant Chern character.
متن کاملLexical Nouns are Both + mass and + count , but they are Neither + mass nor + count
This chapter investigates the rationale for having the lexical categories or features mass and count. Some theories make the features be syntactic; others make them be semantic. It is concluded here that none of the standard accounts of their function actually serve the purpose for which they are adopted, and that we should instead remove these features from the lexicon and have lexical nouns b...
متن کاملMalaria deaths are the hardest to count.
In the early hours of the morning, Aurola Ngueve strapped her feverish daughter to her back and walked almost three kilometres to a tiny Angolan gove ernment health post, a white concrete structure sitting incongruously amid the mud huts of the village of Muinha in central Bié province. In the rudimentary examination room, Aurola anxiously tells the Bulletin that 18emontheold Rosalina, who is s...
متن کاملSyndrome and transition count are uncorrelated
Abstruct-In the testing of logic circuits, two of the proposed data compression methods are the number of ones (syndrome) and the number of sequence changes (transition count). An enumeration N ( m , k , t ) of the number of length-m binary sequences having syndrome value k and transition count t is developed. Examination of this result reveals that the parallel compression of these two methods...
متن کاملZigzag Stacks and m-Regular Linear Stacks
The contact map of a protein fold is a graph that represents the patterns of contacts in the fold. It is known that the contact map can be decomposed into stacks and queues. RNA secondary structures are special stacks in which the degree of each vertex is at most one and each arc has length of at least two. Waterman and Smith derived a formula for the number of RNA secondary structures of lengt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 2022
ISSN: ['1446-8107', '1446-7887']
DOI: https://doi.org/10.1017/s1446788722000179